Circuits and paths through specified nodes
نویسندگان
چکیده
منابع مشابه
Improving Synthesis of Reversible Circuits: Exploiting Redundancies in Paths and Nodes of QMDDs
In recent years, reversible circuits have become an established emerging technology through their variety of applications. Since these circuits employ a completely different structure from conventional circuitry, dedicated functional synthesis algorithms have been proposed. Although scalability has been achieved by using approaches based on decision diagrams, the resulting circuits employ a sig...
متن کاملEuler Circuits and Paths 1
Let D be a set, let T be a non empty set of finite sequences of D, and let S be a non empty subset of T . We see that the element of S is a finite sequence of elements of D. Let i, j be even integers. One can verify that i − j is even. We now state two propositions: (1) For all integers i, j holds i is even iff j is even iff i − j is even. (2) Let p be a finite sequence and m, n, a be natural n...
متن کاملForbidden subgraphs and the existence of paths and cycles passing through specified vertices
In [2], Duffus et al. showed that every connected graph G which contains no induced subgraph isomorphic to a claw or a net is traceable. And they also showed that if a 2-connected graph G satisfies the above conditions, then G is hamiltonian. In this paper, modifying the conditions of Duffus et al.’s theorems, we give forbidden structures for a specified set of vertices which assures the existe...
متن کاملTiming Analysis with Implicitly Specified False Paths
We consider the problem of timing analysis in the presence of known false paths. The main difficulty in adaptation of classical breadth-first search to the problem is that at each node one has to store the number of delays which is proportional to that of false paths going through the node. We propose a reduction technique that allows one to drastically reduce the number of delays to store. In ...
متن کاملGraph partition into paths containing specified vertices
For a graph G, let 2(G) denote the minimum degree sum of a pair of nonadjacent vertices. Suppose G is a graph of order n. Enomoto and Ota (J. Graph Theory 34 (2000) 163–169) conjectured that, if a partition n = ∑k i=1 ai is given and 2(G)¿ n + k − 1, then for any k distinct vertices v1; : : : ; vk , G can be decomposed into vertex-disjoint paths P1; : : : ; Pk such that |V (Pi)| = ai and vi is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1973
ISSN: 0095-8956
DOI: 10.1016/0095-8956(73)90029-4